An improved algorithm to test copositivity
نویسندگان
چکیده
منابع مشابه
An LP-based Algorithm to Test Copositivity
A symmetric matrix is called copositive if it generates a quadratic form taking no negative values over the nonnegative orthant, and the linear optimization problem over the set of copositive matrices is called the copositive programming problem. Recently, many studies have been done on the copositive programming problem (see, for example, [14, 5]). Among others, several branch and bound type a...
متن کاملAn Improved WAGNER-WHITIN Algorithm
We present an improved implementation of the Wagner-Whitin algorithm for economic lot-sizing problems based on the planning-horizon theorem and the Economic- Part-Period concept. The proposed method of this paper reduces the burden of the computations significantly in two different cases. We first assume there is no backlogging and inventory holding and set-up costs are fixed. The second model ...
متن کاملAn Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کاملan improved wagner-whitin algorithm
we present an improved implementation of the wagner-whitin algorithm for economic lot-sizing problems based on the planning-horizon theorem and the economic- part-period concept. the proposed method of this paper reduces the burden of the computations significantly in two different cases. we first assume there is no backlogging and inventory holding and set-up costs are fixed. the second model ...
متن کاملAn Improved Test Generation Algorithm for Pair-Wise Testing
Pair-wise or two-way interaction testing requires that for a given numbers of input parameters to the system, each possible combination of values for any pair of parameters be covered by at least one test. Empirical results show that pair-wise testing is practical and efficient for various types of software systems [1]. The problem of generating a minimum test set for pair-wise testing is NP-co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2011
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-011-9766-2